The Efron dice voting system
نویسندگان
چکیده
About fty years ago, Efron noted some counterintuitive properties of the long-term behavior of contests involving dice. For instance, consider the 6-sided dice whose sides are labeled (4,4,4,4,0,0), (3,3,3,3,3,3), (6,6,2,2,2,2), and (5,5,5,1,1,1). Each die has a 2/3 probability of rolling a higher number than the next one in the list, and the last has the same 2/3 probability of rolling a higher number than the rst. The nontransitivity of games involving non-identical dice was popularized by Gardner in Scienti c American. Although Gardner and other authors have observed that nontransitive dice serve to illustrate the complexities of the theory of voting, it does not seem that much attention has been paid to the corresponding voting system. Our purpose in this paper is to present this voting system, and compare its properties with those of other voting systems. One of the most interesting properties is the fact that cancellation with respect to the Efron dice voting system can replace cancellation with respect to pairwise preferences in Youngs characterization of the social choice function associated with the Borda Count.
منابع مشابه
Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملAn improved approach for ranking the candidates in a voting system based on efficiency intervals
This paper proposes improvements and revisions to a recent approach in a voting system, and provides an effective approach with a stronger discriminate power. For this purpose, the advantage of a linear transformation is utilized to redene a previously used concept of virtual worst candidate, by incorporating the existing weight restrictions. Then, the best score of this virtual candidate is us...
متن کاملAn Optimal Single-Winner Preferential Voting System Based on Game Theory∗
We present an optimal single-winner preferential voting system, called the “GT method” because of its interesting use of symmetric two-person zero-sum game theory to determine the winner. Game theory is not used to describe voting as a multi-player game between voters, but rather to define when one voting system is better than another one. The cast ballots determine the payoff matrix, and optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Social Choice and Welfare
دوره 39 شماره
صفحات -
تاریخ انتشار 2012